Embedding coverings of 2-paths with 3-paths
نویسندگان
چکیده
منابع مشابه
Uniform coverings of 2-paths with 5-paths in K2n
We give a construction of a uniform covering of 2-paths with 5-paths in Kn for all even n ≥ 6, i.e., we construct a set S of 5-paths in Kn having the property that each 2-path in Kn lies in exactly one 5-path in S for all even n ≥ 6.
متن کاملUniform coverings of 2-paths by 4-paths
We construct a uniform covering of 2-paths by 4-paths in Kn for all n 2:: 5, i.e., we construct a set S of 4-paths in Kn having the property that each 2-path in Kn lies in exactly one 4-path in S for all 11, 2:: 5.
متن کاملFrom (2, 3)-Motzkin Paths to Schröder Paths
In this paper, we provide a bijection between the set of restricted (2, 3)-Motzkin paths of length n and the set of Schröder paths of semilength n. Furthermore, we give a one-to-one correspondence between the set of (2, 3)-Motzkin paths of length n and the set of little Schröder paths of semilength n + 1. By applying the bijections, we get the enumerations of Schröder paths according to the sta...
متن کاملVertex coverings by monochromatic paths and cycles
We survey some results on covering the vertices of 2-colored complete graphs by two paths or by two cycles of different color. We show the role of these results in determining path Ramsey numbers and in algorithms for finding long monochromatic paths or cycles in 2-colored complete graphs. A graph is 2-colored if each edge is colored either red or blue. We consider results on covering the verti...
متن کاملMonotone Simultaneous Embedding of Directed Paths
We consider a variant of monotone simultaneous embeddings (MSEs) of directed graphs where all graphs are directed paths and have distinct directions of monotonicity. In contrast to the known result that any two directed paths admit an MSE, there exist examples of three paths that do not admit such an embedding for any possible choice of directions of monotonicity. We prove that if an MSE of thr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.10.029